Matching Multiple Rigid Domain Decompositions of Proteins
نویسندگان
چکیده
منابع مشابه
Partial matching of rigid shapes
Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show an approach allowing to find matching parts of ri...
متن کاملEar-decompositions of matching covered graphs
We call a graph matching-covered if every line belongs to a perfect matching. We study the technique of "ear-decompositions" of such graphs. We prove that a non-bipartite matchingcovered graph contains K~ or K2@Ka (the triangular prism). Using this result, we give new characterizations of those graphs whose matching and covering numbers are equal. We apply these results to the theory of r-criti...
متن کاملShape matching under rigid motion
We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under translation in Õ(n2ε−3) time. The error is additive and it is at most ε · min{area(P ), area(Q)} with probability 1 − n−O(1). We also obtain an al...
متن کاملA Fuzzy Matching Approach to Multiple Structure Alignment of Proteins
Motivation: Comparing protein structures is important for understanding the relationships between sequence, structure and function. With the increasing number of experimentally determined protein structures, an automated algorithm that can perform structure alignment of many proteins is therefore highly advantageous. Results: We present a novel approach for multiple structure alignment of prote...
متن کاملAdaptive Time - Frequency Decompositions with Matching
Computing the optimal expansion of a signal in a redundant dictionary of waveforms is an NP-hard problem. We introduce a greedy algorithm, called a matching pursuit, which computes a sub-optimal expansion. The dictionary waveforms which best match a signal's structures are chosen iteratively. An orthogonalized version of the matching pursuit is also developed. Matching pursuits are general proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on NanoBioscience
سال: 2017
ISSN: 1536-1241,1558-2639
DOI: 10.1109/tnb.2017.2660538